An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
نویسندگان
چکیده
منابع مشابه
An Extension of Chubanov’s Polynomial-Time Linear Programming Algorithm to Second-Order Cone Programming
Recently, Chubanov proposed an interesting new polynomial-time algorithm for linear program. In this paper, we extend his algorithm to second-order cone programming.
متن کاملSecond-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملAn Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
In this paper, we propose an explicit exchange algorithm for solving semiinfinite programming problem (SIP) with second-order cone (SOC) constraints. We prove, by using the slackness complementarity conditions, that the algorithm terminates in a finite number of iterations and the obtained solution sufficiently approximates the original SIP solution. In existing studies on SIPs, only the nonneg...
متن کاملA Polynomial Primal-Dual Path-Following Algorithm for Second-order Cone Programming
Second-order cone programming (SOCP) is the problem of minimizing linear objective function over cross-section of second-order cones and an a ne space. Recently this problem gets more attention because of its various important applications including quadratically constrained convex quadratic programming. In this paper we deal with a primal-dual path-following algorithm for SOCP to show many of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2017
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556788.2017.1382495